An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
نویسندگان
چکیده
منابع مشابه
An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملAn Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn exact algorithm for the precedence-constrained single-machine scheduling problem
This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...
متن کاملA monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m)-approximation algorithm for scheduling related machines with precedence constraints.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00328-6